On a class of finite symmetric graphs
نویسندگان
چکیده
منابع مشابه
On a class of finite symmetric graphs
Let Γ be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of Γ . This paper aims to characterize (Γ ,G) under the conditions that the quotient graph ΓB is (G, 2)-arc transitive and the induced subgraph between two adjacent blocks is 2 · K2 or K2,2. The results answer two questions about the relationship between Γ and ΓB for this class of graphs. c © 2007 El...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملOn minimal symmetric automorphism groups of finite symmetric graphs
Let r be finite connected and G a group of automorphisms of r which is transitive on vertices. Suppose that, for a vertex 0 of r, S ~ G~(O') ::; Aut S for some simple group S with S acting primitively on the set r( a) of neighbours of 0, and suppose that G is minimal with these properties. Then one of: (i) G is a nonabelian simple group, (ii) r is a Cayley graph for a normal subgroup N of G and...
متن کاملConstructing a Class of Symmetric Graphs
We find a natural construction of a large class of symmetric graphs from pointand block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B,C of B, either there is no edge between B and C , or there exists only one vertex in B not adjacent to any verte...
متن کاملA Class of Ramsey-finite Graphs
Introduction Let F, G and H be finite, undirected graphs without loops or multiple edges . Write F*(G,H) to mean that it the edges of F are colored with two colors, say red and blue, then either the red subgraph of F contains a copy of G or the blue subgraph contains a copy of H . The class of all graphs F (up to isomorphism) such that F.(G,H) will be denoted by R'(G,H) . This class has been st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2008
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2007.04.020